Global Convergence of a Modified Sqp Method for Mathematical Programs with Inequalities and Equalities Constraints
نویسنده
چکیده
When we solve an ordinary nonlinear programming problem by the most and popular sequential quadratic programming (SQP) method, one of the difficulties that we must overcome is to ensure the consistence of its QP subproblems. In this paper, we develop a new SQP method which can assure that the QP subproblem at every iteration is consistent. One of the main techniques used in our method involves solving a least square problem in addition to solving a modified QP subproblem at each iteration, and we need not add bound constraints to the search direction. we also establish the global convergence of the proposed algorithm.
منابع مشابه
An inexact alternating direction method with SQP regularization for the structured variational inequalities
In this paper, we propose an inexact alternating direction method with square quadratic proximal (SQP) regularization for the structured variational inequalities. The predictor is obtained via solving SQP system approximately under significantly relaxed accuracy criterion and the new iterate is computed directly by an explicit formula derived from the original SQP method. Under appropriat...
متن کاملSmooth SQP Methods for Mathematical Programs with Nonlinear Complementarity Constraints
Mathematical programs with nonlinear complementarity constraints are refor-mulated using better-posed but nonsmooth constraints. We introduce a class offunctions, parameterized by a real scalar, to approximate these nonsmooth prob-lems by smooth nonlinear programs. This smoothing procedure has the extrabenefits that it often improves the prospect of feasibility and stability...
متن کاملA Robust SQP Method for Mathematical Programs with Linear Complementarity Constraints
The relationship between the mathematical program with linear complementarity constraints (MPCC) and its inequality relaxation is studied. A new sequential quadratic programming (SQP) method is presented for solving the MPCC based on this relationship. A certain SQP technique is introduced to deal with the possible infeasibility of quadratic programming subproblems. Global convergence results a...
متن کاملAn SQP method for mathematical programs with vanishing constraints with strong convergence properties
We propose an SQP algorithm for mathematical programs with vanishing constraints which solves at each iteration a quadratic program with linear vanishing constraints. The algorithm is based on the newly developed concept of [Formula: see text]-stationarity (Benko and Gfrerer in Optimization 66(1):61-92, 2017). We demonstrate how [Formula: see text]-stationary solutions of the quadratic program ...
متن کاملA Smoothing SQP Method for Mathematical Programs with Linear Second-Order Cone Complementarity Constraints∗
In this paper, we focus on the mathematical program with second-order cone (SOC) complementarity constraints, which contains the well-known mathematical program with nonnegative complementarity constraints as a subclass. For solving such a problem, we propose a smoothing-based sequential quadratic programming (SQP) methods. We first replace the SOC complementarity constraints with equality cons...
متن کامل